Complete theory

Results: 1780



#Item
581Email / Massachusetts Institute of Technology / Background check / Academia / Human resource management / National Institute for Materials Science / Nims / Technology

R15-01 (Theory of Condensed Matter Physics) [Important notes] *This form is only for the application for R15-01 (Theory of Condensed Matter Physics) *Please complete the form in English or Japanese.

Add to Reading List

Source URL: www.nims.go.jp

Language: English - Date: 2015-03-01 23:44:51
582Evolutionary biology / Human development / Psychoanalysis / Biological classification / Human behavior / Personal life / Behavior / Attachment theory / Ethology

Application for Classification of a Publication Please complete each of the steps of this form. Each step is explained in further detail in the Apply for Classification pages at www.classification.gov.au Step One: Classi

Add to Reading List

Source URL: www.classification.gov.au

Language: English - Date: 2015-05-08 01:08:57
583Bayesian statistics / Philosophy of science / Statistical theory / Philosophy of mathematics / Probability theory / Statistical inference / Inference / Principle of maximum entropy / Bayesian probability / Statistics / Science / Logic

Review of The Uncertain Reasoner’s Companion: A Mathematical Perspective by J.B. Paris Cambridge University Press, 1994. Ernest Davis, New York University The attainment of a complete formal theory of plausible reasoni

Add to Reading List

Source URL: www.cs.nyu.edu

Language: English - Date: 2013-10-16 16:10:29
584Containers / Operations research / Shipping containers / NP-complete problems / Discrete geometry / Packing problem / Containerization / Knapsack problem / Wooden box / Theoretical computer science / Computational complexity theory / Mathematics

Maejo Int. J. Sci. Technol. 2015, 9(01), Maejo International Journal of Science and Technology ISSNAvailable online at www.mijst.mju.ac.th

Add to Reading List

Source URL: www.mijst.mju.ac.th

Language: English - Date: 2015-04-02 23:15:13
585Ontology / Philosophy of life / Modal logic / Aristotelianism / Gottfried Leibniz / Idealists / Predicate / Property / Substance theory / Philosophy / Metaphysics / Logic

Leibniz on substance in the Discourse on Metaphysics1 Gonzalo Rodriguez-Pereyra Oriel College, Oxford 1. In the Discourse on Metaphysics Leibniz put forward his famous complete-concept definition of substance. Sometimes

Add to Reading List

Source URL: www.philosophy.ox.ac.uk

Language: English - Date: 2015-02-04 09:27:17
586NP-complete problems / Topological sorting / Directed graph / Algorithm / Feedback arc set / Network theory / Shortest path problem / Graph theory / Mathematics / Theoretical computer science

Ranking Tournaments: Local Search and a New Algorithm TOM COLEMAN and ANTHONY WIRTH The University of Melbourne Ranking is a fundamental activity for organising and, later, understanding data. Advice of the

Add to Reading List

Source URL: tom.thesnail.org

Language: English - Date: 2015-05-04 03:09:24
587Tree / Spanning tree / NP-complete problems / Levenshtein distance / Graph theory / Theoretical computer science / Mathematics

A linear-time algorithm for comparing similar ordered trees H´el`ene Touzet LIFL – University of Lille 1 – France Comparison with k errors

Add to Reading List

Source URL: www.cs.ucr.edu

Language: English - Date: 2005-07-08 16:24:06
588NP-complete problems / Graph coloring / Independent set / NP-complete / Clique / Vertex cover / NP / Clique cover problem / Domatic number / Theoretical computer science / Graph theory / Computational complexity theory

CS109B Notes for LectureNP-Complete Problems We have met some problems that have \easy" solutions; they have algorithms that run in time that is polynomial in the size of the graph, the parameter m.  Examples:

Add to Reading List

Source URL: infolab.stanford.edu

Language: English - Date: 2008-09-19 00:58:50
589Metric geometry / Dimension theory / Fractals / Machine learning / Mathematical analysis / Travelling salesman problem / Tree decomposition / Ε-net / Nearest neighbor search / Mathematics / Theoretical computer science / Geometry

Approximating TSP on Metrics with Bounded Global Growth∗ T-H. Hubert Chan Abstract The Traveling Salesman Problem (TSP) is a canonical NP-complete problem which is known to be MAXSNP hard even on (high-dimensional) Euc

Add to Reading List

Source URL: i.cs.hku.hk

Language: English - Date: 2007-10-10 14:10:39
590Graph coloring / NP-complete problems / Graph theory / Parameterized complexity / NP-complete / Theoretical computer science / Mathematics / Applied mathematics

Maximum Motif Problem in Vertex-Colored Graphs

Add to Reading List

Source URL: www.cs.ucr.edu

Language: English - Date: 2009-06-21 01:15:30
UPDATE